Algorithm-based analysis of collective decoherence in quantum search

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-Markovian decoherence in the adiabatic quantum search algorithm

We consider an adiabatic quantum algorithm (Grover’s search routine) weakly coupled to a rather general environment, i.e., without using the Markov approximation. Markovian errors generally require high-energy excitations (of the reservoir) and tend to destroy the scalability of the adiabatic quantum algorithm. We find that, under appropriate conditions (such as low temperatures), the low-energ...

متن کامل

Superradiance as a source of collective decoherence in quantum computers

We analyze the radiative coupling of qubits to a common radiation bath in free space and discuss that superradiance (collective emission) results in decoherence that scales with the square of the number of qubits. This decoherence mechanism is nonlocal; the collective emission simultaneously decoheres all the qubits in the computer. Because the noise source is not local, the introduced errors a...

متن کامل

Faster Together: Collective Quantum Search

Joining independent quantum searches provides novel collective modes of quantum search (merging) by utilizing the algorithm’s underlying algebraic structure. If n quantum searches, each targeting a single item, join the domains of their classical oracle functions and sum their Hilbert spaces (merging), instead of acting independently (concatenation), then they achieve a reduction of the search ...

متن کامل

Decoherence on Grover’s quantum algorithm: perturbative approach

In this paper, we study decoherence on Grover’s quantum searching algorithm using a perturbative method. We assume that each two-state system (qubit) suffers σz error with probability p (0 ≤ p ≤ 1) independently at every step in the algorithm. Considering an n-qubit density operator to which Grover’s operation is applied M times, we expand it in powers of 2Mnp and derive its matrix element incl...

متن کامل

Quantum Error Correction Protects Quantum Search Algorithms Against Decoherence

When quantum computing becomes a wide-spread commercial reality, Quantum Search Algorithms (QSA) and especially Grover's QSA will inevitably be one of their main applications, constituting their cornerstone. Most of the literature assumes that the quantum circuits are free from decoherence. Practically, decoherence will remain unavoidable as is the Gaussian noise of classic circuits imposed by ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Progress in Informatics

سال: 2006

ISSN: 1349-8614,1349-8606

DOI: 10.2201/niipi.2006.3.2